Techniques for guaranteeing bandwidth with aggregate traffic

ABSTRACT

Methods, systems, and apparatus guarantee bandwidth for a network transaction. A network is logically organized as a tree having a plurality of nodes. Each node can guarantee service for a network transaction through the network. Each node monitors its traffic and reserves predefined amounts of unused bandwidth with its adjacent node. If a particular node needs additional bandwidth, that node borrows the bandwidth from its adjacent node.

This application is a continuation of U.S. patent application Ser. No.11/383,980, filed on May 18, 2006, which is a continuation under 35U.S.C. 111(a) of International Application No. PCT/CN2003/001141, filedon Dec. 30, 2003, and published in English on Jul. 21, 2005 asInternational Publication No. WO 2005/067203 A1, all of which areincorporated herein by reference in their entireties.

TECHNICAL FIELD

Embodiments of the present invention relate generally to computernetworks, and more particularly to bandwidth management for networktraffic.

BACKGROUND INFORMATION

Quality of Service (QoS) is the concept that transmission rates, errorrates, and other network transmission characteristics can be measured,improved, and to some extent guaranteed in advance of a networktransmission. QoS is a significant concern for high bandwidth networksthat regularly transmit large amounts of data such as video, audio,multimedia, and the like. Moreover, QoS is problematic forgeographically dispersed networks, such as the Internet, where anysingle network transaction can span multiple sub-networks throughmultiple Internet Service Providers (ISPs).

Attempts to provide decent QoS architectures often suffer fromscalability issues. That is, independent sub-networks (e.g., ISPs) arerequired to be too heavily dependent upon one another to produce anyviable commercial solution. As soon as independent sub-networks becomedependent upon the operational specifics of other sub-networks, theybecome less scalable and less desirable. When scalability is adequatelyachieved, the result is usually achieved with overly compleximplementation schemes that dramatically decrease network throughput atthe expense of providing scalability.

Accordingly a more scalable QoS technique for large geographicallydisperse networks is needed, where scalability is achieved in a mannerthat does not significantly impact network throughput and is not overlycomplex.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is diagram of a network to guarantee service in accordance withone embodiment of the invention.

FIG. 2 is a flow diagram of a method to guarantee network service inaccordance with one embodiment of the invention.

FIG. 3 is a flow diagram of a method to manage bandwidth of a guaranteednetwork service request in accordance with one embodiment of theinvention.

FIG. 4 is a diagram of a bandwidth management system in accordance withone embodiment of the invention.

DESCRIPTION OF THE EMBODIMENTS

FIG. 1 is a diagram of a network 100 that guarantees service for networktransactions before the transactions are processed within the network100. The technique is implemented in a computer-accessible medium withinprocessing devices of a network. These devices can be routers, hubs,bridges, switches, gateways, firewalls, proxies, servers, clientworkstations, and the like. The network 100 is logically represented inthe computer-accessible medium as a tree where each branch of the treeis a node. A node is a processing device that participates in a networktransaction by routing data packets associated with the networktransaction between originating nodes and destination nodes.

The embodiments of this invention provide improved techniques forguaranteeing service betweens node of a network 100.

Guaranteeing means that bandwidth availability is assured before anetwork transaction commences, assuming that the nodes and links of thenetwork 100 remain operational and do not otherwise fail. One ofordinary skill in the art readily appreciates that an absolute assurancethat a network transaction will complete within a network 100 is notfeasible, since links and nodes can fail abnormally due to hardware orsoftware failures, or links and nodes can fail due to plannedmaintenance activity.

The network 100 depicted in FIG. 1 includes a variety of AutonomousSystems (AS) that can operate independently of one another. These aSscan be viewed as independent sub-networks, such as ISPs, privatenetworks and the like. The sub-networks can geographically span theentire world. Within each AS, a number of processing nodes are used todirectly communicate with other external ASs; these nodes are referredto as edge nodes.

The entire network 100 is logically organized as a tree. In FIG. 1, thattree is inverted, such that the root of the tree is identified by AS Yand the farthest leaf is identified by AS X. The root node of the treeis edge node D. AS N is a father of children 0, 1, and 2. Moreover, thechildren are considered brothers to each other. Each AS can itself beconsidered a sub-tree, having its own internal root node, father node,and brother nodes. Moreover, the children of a father are considered itssons. Thus, father AS N has sons identified as Child 0, Child 1, andChild 2. Moreover, AS N is considered a grandfather of AS X.

A network transaction is a communication between any two or more nodesof the network 100. A node that originates the network transaction iscalled an originating node. A network transaction transfers data packetsfrom an originating node to a destination node. Thus, the node that theoriginating node desires to communicate with via a network transactionis referred to as a destination node. A network transaction will includethe transfer of one or more network data packets from the originatingnode through one or more intermediate nodes to the destination node.Thus, the network transaction is associated with a path through thenetwork from the originating node to the destination node. A variety ofpath generating and dynamic modifying algorithms are well known in thenetworking arts and readily achievable using existing networkarchitectures and protocols. All such algorithms and architectures arecapable of being used with the embodiments of this invention.

The volume of and rate at which network packets are present and sentbetween any two nodes of the network 100, is referred to as thebandwidth. These data transfers occur over the links of the network 100,the links connect the nodes. Each link can be capable of handlingdifferent types of media, different volumes, different rates, and adifferent number of concurrent sessions of network transactions. Thehard and soft limitations of each link are known in advance by each nodebased on its hardware and software configurations. These limitations canbe communicated between nodes using well known and existing networkingprotocols and technologies.

When an originating node requests a particular network transactiondirected to a destination node, the originating node would like to knowin advance of commencing the transaction that a sufficient amount ofbandwidth will exist within the network 100 in order to process thetransaction to the destination node. In embodiments of the presentinvention, this is achieved with a Bandwidth Conservation Criterion(BCC) calculation. The originating node makes a request for a networktransaction to the first processing node defined in the network path.The first processing node identifies the total available bandwidth ofthe destination node and sums the bandwidth of all outstanding trafficthat is destined for the destination node. This calculation is the BCCcalculation that guarantees the originating node that bandwidth willexist to satisfy the transaction. IN response to the guarantee, theoriginating node commences the network transaction through the network100.

As an example, consider an originating node A that requests a networktransaction requiring 10 KB of bandwidth. The transaction is directed todestination node N and is initially requested of initial processing nodeB. N can have a maximum bandwidth of 128 KB. When A makes the request toB, the current aggregate traffic directed to N is 110 KB.

In the present example, B applies BCC to determine that if the networktransaction is guaranteed there will be 120 KB of current trafficdirected towards N, which is less than the maximum bandwidth of 128 KBthat N can handle at any point in time. Thus, B makes the BCCcalculation when it receives the request from A and determines that thenetwork transaction can be guaranteed. The guarantee is thencommunicated from B to A, and the network transaction commences.

BCC can be defined with the following equations, where the originatingnode is the node identified in AS X and the destination node is edgenode D of AS Y (the root of the tree):

$\quad\left\{ \begin{matrix}{{\sum\limits_{i}r_{ij}^{D}} \leq r_{jk}^{D}} \\{B_{ij}^{X} = {\sum\limits_{y}r_{ij}^{y}}}\end{matrix} \right.$

B_(ij) ^(x) is the overall bandwidth of AS X available between edgenodes i and j and r_(ij) ^(D), the corresponding portion of AS X in thetree rooted by edge node D. Thus, if the bandwidth request associatedwith a network transaction when combined with the total aggregatebandwidth destined for edge node D is less than the total bandwidth thatedge node D can handle, the BCC equation holds true and a networktransaction can be guaranteed service.

This calculation is a scalable approach, because all that is needed is acalculation that sums existing aggregate traffic that is being directedto a destination node along with the known bandwidth limit associatedwith the destination node. By aggregate traffic it is meant that allcurrent network traffic that is active in the network and is currentlybeing directed to the destination node. However, at any given point asthe network transaction is progressing through the network 100, one ormore nodes may not have sufficient bandwidth to handle the networkrequest. Thus, BCC can be augmented to make necessary dynamicadjustments as needed at each processing node associated with a networkpath of a network transaction, which is guaranteed by the BCC equation.

For example, a network transaction may progress after a guarantee ofservice from AS m to edge node j′ of AS Y. At this point in time,however, the current bandwidth for the link between node j′ and k (linkj′-k) may be at capacity and not capable of handling the networktransaction. Without the ability for link j′-k to increase its bandwidththe transaction may fail or become unreasonably delayed. Thus, thestatic approach of BCC can be augmented with a Closest relationAllocatioN (CLAN) technique, that permits nodes to borrow bandwidth fromadjacent (brother, son, father) nodes.

With the CLAN technique, each node of the network 100 monitors thetraffic volume occurring with its link to its adjacent nodes, morespecifically with its father node. When a particular node notices areduction in bandwidth occurring with its link to its father node, thatreduction is known to the father node (adjacent node). This reservedbandwidth is held by the father node and delivered to other more needingsons of the father when needed.

Thus, in the example, presented above, if the link j′-k can hold 128 KBvolume and is at capacity when a network transaction comes along thatneeds to reach node k, then node k can borrow 64 KB from one or both ofits two remaining sons. Node k knows the 64 KB is obtainable from one orits two remaining sons, because if finds the two remaining sons havingchunks of available bandwidth to their father node K during processingand request bandwidth from their father node when needed.

For example, consider that the three links to node k each have a totalbandwidth capacity of 128 KB and consider further that each son node isconfigured to manage only 64 KB of capacity at any one time andconfigured to release and to notify the father node k whenever bandwidthis needed above 64 KB and the father node will be aware when capacityabove 64 KB is no longer needed for any given transaction. The fathernode k then manages this excess bandwidth and when a network transactionmoving from link j′-k, in our present example, needs additionalbandwidth; the father node k has it in reserve to deliver to the sonnode j′, because the bandwidth has been previously borrowed from one orboth brothers of node j′.

Borrowing can occur between any two adjacent nodes or brother nodes.Moreover, the borrowing need not occur within a single AS. For exampleedge node j′ connects two different aSs (L and M) to AS N. Thus, edgenode j of AS M can borrow from the appropriate edge node of AS L inorder to complete a transaction over link j-j′. This occurs through j′,which acts as an adjacent node or father node to both node j and theedge node of AS L that directly connects to node j′.

Thus, with CLAN, adjacent nodes establish policies with one another suchthat chunks of bandwidth are managed by father nodes on behalf of theirsons. These chunks of bandwidth are considered reserves, which must berequested before the reserves can be used from the appropriate fathernode. Thus, son nodes borrow, via their father, bandwidth that exceeds apre-negotiated amount; the bandwidth borrowed comes from the brothernodes of a borrowing son node, but is managed by their father node. In asimilar fashion father node can borrow from its father within thenetwork 100, such that at any one time a borrowing node may be gettingbandwidth from its brothers and from brothers of its father.

Hierarchical relationships between nodes of a network are managed inorder to borrow bandwidth with the CLAN technique; the borrowing isneeded for a network transaction that is progressing through nodes of anetwork. That is, a node in need of more bandwidth uses its closestrelationship to adjacent nodes to acquire the necessary bandwidthallocation and this borrowing can progress upward through that node'srelatives after first borrowing from its closest relation.

Further, the BCC calculation permits a transaction guarantee to be givento an originating node of a network transaction, where that networktransaction requires a certain amount of bandwidth through a network 100in order to reach a destination node. Moreover, as the networktransaction progresses through the network 100, if any particular linkbetween nodes lacks sufficient bandwidth to process the transaction, thebandwidth can be temporarily borrowed from adjacent nodes using the CLANtechnique. The BCC and CLAN techniques provide a scalable solution toQoS for aSs or independent networks. These techniques are not overlycomplex and can be implemented within existing network protocols andsoftware designed to calculate the BCC and implement the CLAN technique.

FIG. 2 is a flow diagram of one method 200 to guarantee network serviceby implementing the BCC and CLAN techniques discussed above with FIG. 1.The method 200 is implemented in a computer accessible medium andprocesses on each node of a network. The nodes are processing devices inthe network which originate, route, and process network transactionsthrough a network. The method 200 can be implemented within each node ofthe network as software, firmware, and/or via network protocols.

Initially, at 210, a request for a network transaction is received by afirst processing node. The request originates from an originating node.The network transaction is associated with a network path which definesone or more routes for network packets associated with the networktransaction to traverse through one or more intermediate nodes of thenetwork to a destination node. The first processing node is the firstnode of that network path.

When the first processing node receives the network request from theoriginating node, it determines whether the request is acceptable basedon the BCC calculation by checking if the aggregate traffic existing inthe network which is destined for the destination node plus thebandwidth needed by the network transaction exceeds the destinationnode's maximum bandwidth. The BCC calculation and the appropriate checkare made at 220. If the aggregate traffic plus the bandwidth needed doesexceed the destination node's bandwidth limit, then, at 222, the networktransaction cannot be guaranteed and the originating node is notified ofthe same.

However, if at 220, the aggregate traffic plus the bandwidth needed doesnot exceed the destination node's bandwidth limit, then, at 230, thefirst processing node guarantees to the originating node that therequested network transaction will have sufficient bandwidth to reachthe destination node within the network. In one embodiment, as soon asthis guarantee occurs, the total available bandwidth at the destinationnode is decremented at 240 by the bandwidth which is needed to satisfythe current network transaction.

Of course there are a variety of ways to implement the BCC calculation.One technique would be to have the destination node keep track oftraffic headed its way and maintain a current available bandwidthcounter, which is constantly and dynamically changing. Another way is tohave each node dynamically make queries to other nodes in the network todynamically calculate the BCC. One skilled in the art will readilyappreciate that other techniques can also exist. All such techniques,which resolve the BCC calculation, are intended to be included in theembodiments of this invention.

Once the first processing node guarantees service, the networktransaction commences to process through the network to the destinationnode at 250. In some embodiments, at some point, during the processingof the network transaction, a particular processing node may determinethat it actually lacks the necessary bandwidth needed to process thenetwork transaction through a link to a next node of the network pathassociated with the network transaction, as depicted at 260. Each nodeof the network dynamically implements the CLAN technique discussed abovewith FIG. 1 in order to dynamically resolve this problem.

Accordingly, at 270, the particular processing node that lackssufficient bandwidth borrows the needed bandwidth from an adjacent nodein order to process the network transaction. Thus, the father node ofthe particular processing node manages reserve bandwidth on behalf ofthe particular processing node and the particular processing node'sbrother nodes. These nodes pre-establish with one another the amount ofexcess bandwidth that the father node will be responsible for managingand delivering, if and when excess bandwidth is needed by any of thesons of the father. Additionally, in some embodiments, the father nodeof a needy son may not have sufficient bandwidth to satisfy a needingson's bandwidth request. In these situations, the father contacts hisfather (adjacent node to the father and grandfather of the needing son)in order to borrow bandwidth from brothers of the father (grandfather tothe needing son). This borrowing continues as needed according to therules associated with the CLAN technique, as described above in FIG. 1.

The embodiments of method 200 demonstrate how the BCC and CLAN techniquecan be implemented and processed within nodes of a network in order toprovide a scalable QoS from heterogeneous aSs logically organized as asingle network. These embodiments are not complex and can be deployedwith software processing on each network node that uses conventionalnetwork protocols to communicate between nodes.

FIG. 3 is a flow diagram of one method 300 to manage bandwidth of aguaranteed network service request. The method 300 is implemented withineach node of a network and is implemented in a computer accessiblemedium. The method 300 represents processing performed by each node andsome interactions occurring between nodes during a network transaction.The method 300 represents embodiments of the CLAN technique, where nodesborrow and manage bandwidth within a network during a networktransaction.

At 310, a processing node associated with processing a networktransaction through a network to a destination node monitors its owntraffic volume. The processing node has previously used policies knownto its adjacent nodes (brothers, father, and sons) in order to configureit to monitor traffic at specific predefined levels. When traffic fallsbelow the predefined limit, then this is detected at 320, and predefinedamounts of bandwidth that are available are reserved as beingunavailable to the processing node at 330.

Those predefined amounts of reserved bandwidth are known to theprocessing node's father node (adjacent node) at 340. The father nodemanages a pool of reserved bandwidth on behalf of the processing nodeand on behalf of brothers of the processing node. Thus, at 350, whenanother node (brother node of the original processing node) isprocessing its own network transaction and determines that it needsadditional bandwidth to process the network transaction through to thefather node, the brother node makes a request at 360 to borrow theneeded bandwidth from the father node (adjacent node). The brother hasdirectly borrowed the bandwidth from the father, but indirectly borrowedit from the excess capacity that the brother's siblings had previouslydeposited with the father for purposes of management.

This bandwidth management and borrowing technique reflects an exampleimplementation of the CLAN technique discussed above with FIGS. 1 and 2.Policies about management associated with bandwidth deposits (e.g.,reservations) and withdrawals are communicated between adjacent nodes ofthe network. Moreover, at 370, each node of the network is capable ofresolving the BCC calculation when needed by maintaining techniques forresolving (e.g., calculating) the aggregate bandwidth associated withany particular destination node of a particular network transaction.

Method 300 provides an example implementation of the CLAN technique andmaintains the capabilities when needed to perform the BCC calculation.This demonstrates how a heterogeneous network consisting of a pluralityof nodes can interact in a scalable fashion with one another to provideQoS for a network transaction.

FIG. 4 is a diagram of one bandwidth management system 400. Thebandwidth management system 400 represent an embodiment of the BCC andCLAN technique within a heterogeneous network, where the networkincludes a plurality of sub-networks identified as ASs. The bandwidthmanagement system 400 is implemented in a computer accessible medium.

The bandwidth management system 400 includes logically representing theheterogeneous network as a network tree 401, wherein branches of thetree 401 can include other sub-trees. The tree 401 can be entirelymanaged and manipulated by pointers and metadata associated with theattributes and characteristics of the tree 401. The tree 401 includes aplurality of nodes 402 and 403. Each node 402 or 403 assumes adesignation as a son, father, and/or brother depending upon its contextwithin the tree to another adjacent node 402 or 403. Thus, a single node402 or 403 can have multiple designations with respect to adjacent nodes402 and 403. A node can also have a designation with respect tonon-adjacent nodes, such as grandfather, grandson, uncle, and the like.

Each node 402 or 403 also includes its own traffic monitor 402A-403A,bandwidth modifier 402B-403B, and signaling processor 402C-403C. Theseentities combine both software logic and existing networking protocolsto perform the BCC and CLAN techniques.

Thus, the traffic monitor 402A-403A monitors traffic on its respectivenode 402 or 403 and communicates traffic information to the trafficmonitors 402A-403A of its adjacent nodes 402 or 403. This communicationand monitoring is useful in resolving the processing associated with theBCC and CLAN techniques. For example, traffic volumes can be aggregatedto resolve the BCC calculation for a particular destination node of aparticular network transaction. Moreover, the traffic volumes can beused to determine whether to deposit bandwidth with or to withdraw onloan bandwidth from an adjacent node 402 or 403.

The bandwidth modifier 402B-403B communicates with the traffic monitor402A-403A in order to adjust bandwidth associated with its particularprocessing node 402 or 403. That is, when the traffic monitor 402A-403Areports bandwidth below a predefined and pre-negotiated amount, thebandwidth modifier 402B-403B can be used to implement the CLAN techniqueand claim additional bandwidth not being used as reserved bandwidth,which is then deposited with an adjacent node 402 or 403. Conversely,when a node 402 or 403 needs additional bandwidth, the bandwidthmodifier 402B-403B can be used to detect this need based on a currenttransaction and based on reports of bandwidth usage from the trafficmonitor 402A-403A in order to request more bandwidth on loan from anadjacent node 402 or 403.

The signaling processor 402C-403C can be used to actually allocate andreallocate need bandwidth or excess bandwidth from an adjacent node 402or 403. That is, the actual device that permits bandwidth to beredirected to a specified link can be controlled with the signalingprocessor 402C-403C. In essence, bandwidth is reallocated and throttledup or throttled down over physical links when bandwidth is deposited orwithdrawn from an adjacent node 402 or 403. This throttling is theresponsibility of the signaling processor 402C-403C.

During operation, the traffic monitor 402A-403A reports traffic on itsnode 402 or 403 to the adjacent nodes 402 or 403. The bandwidth modifier402B-403B uses this in combination with existing network requests tomodify bandwidth. The signaling processor 402C-403C detects modifiedbandwidth and drives the underlying bandwidth device to throttle up anddown affected links of the nodes 402 and 403.

The use of the traffic monitor 402A-403A, the bandwidth modifier402B-403B, and the signaling processor 402C-403C provides a modularevent-driven implementation of the BCC and CLAN technique that isscalable across a large heterogeneous network. However, one of ordinaryskill in the art appreciates that other implementations andarchitectures are possible where the functions of the modules arefurther isolated into more modules or combined into less modules. Allsuch modifications to this architecture that are designed to perform theBCC or CLAN techniques fall within the scope of the embodiments for thisinvention.

The above description is illustrative, and not restrictive. Many otherembodiments will be apparent to those of skill in the art upon reviewingthe above description. The scope of embodiments of the invention shouldtherefore be determined with reference to the appended claims, alongwith the full scope of equivalents to which such claims are entitled.

The Abstract is provided to comply with 37 C.F.R. §1.72(b) requiring anAbstract that will allow the reader to quickly ascertain the nature andgist of the technical disclosure. It is submitted with the understandingthat it will not be used to interpret or limit the scope or meaning ofthe claims.

In the foregoing description of the embodiments, various features aregrouped together in a single embodiment for the purpose of streamliningthe disclosure. This method of disclosure is not to be interpreted asreflecting an intention that the claimed embodiments of the inventionrequire more features than are expressly recited in each claim. Rather,as the following claims reflect, inventive subject mater lies in lessthan all features of a single disclosed embodiment. Thus the followingclaims are hereby incorporated into the Description of the Embodiments,with each claim standing on its own as a separate exemplary embodiment.

1. (canceled)
 2. A method, comprising: receiving a network transactionrequest from an originating node; guaranteeing the originating node anamount of reserved bandwidth to process the network transaction througha network of intermediate nodes to a destination node before processinga network transaction associated with the network transaction request byaggregating and borrowing bandwidth from one or more adjacent nodes tothe intermediate nodes to obtain the amount of reserved bandwidth inadvance of processing the network transaction.
 3. The method of claim 2,wherein guaranteeing further includes detecting that one or more of theintermediate nodes have insufficient bandwidth to process the networktransaction and acquiring the borrowed bandwidth from the one or moreadjacent nodes to those intermediate nodes.
 4. The method of claim 2,wherein guaranteeing further includes borrowing by at least one adjacentnode additional bandwidth from a particular node that is adjacent to theat least one adjacent node.
 5. The method of claim 2, whereinguaranteeing further includes identifying existing bandwidth in use bythe destination node and requesting particular nodes along a path forthe network transaction to the destination node set aside and resolvethe reserved bandwidth for processing the network transaction.
 6. Themethod of claim 5, wherein identifying further includes aggregatingpending network traffic bandwidth that is being directed to thedestination node to resolve the existing bandwidth in use by thedestination node.
 7. The method of claim 2, wherein guaranteeing furtherincludes dynamically instructing the intermediate nodes to adjustborrowing from the adjacent nodes to ensure the reserved bandwidth whenthe network transaction is processed when conditions with theintermediate nodes and the adjacent nodes have changed during theprocessing of the network transaction.
 8. A non-transitorycomputer-readable storage medium having executable instructions, whichwhen processed by a machine performs a method, comprising: receiving anetwork transaction directed to a destination node for processing over anetwork; identifying current bandwidth being directed to the destinationnode by other network transactions of the network; configuringintermediate nodes of the network to set aside a reserved bandwidth forprocessing the network transaction by borrowing bandwidth from adjacentnodes to the intermediate nodes when the intermediate nodes lacksufficient bandwidth to ensure the reserved bandwidth; and processingthe network transaction through the configured intermediate nodes to thedestination node.
 9. The medium of claim 8, wherein identifying furtherincludes summing existing bandwidth from particular nodes that connectto the destination node to identify the current bandwidth.
 10. Themedium of claim 8, wherein configuring further includes resolving a pathfor the network transaction to the destination node to identify theintermediate nodes for configuration.
 11. The medium of claim 8, whereinconfiguring further includes guaranteeing an originating node for thenetwork transaction that the network transaction will process with thereserved bandwidth when a maximum bandwidth of the destination node isless than or equal to the sum of the current bandwidth and the reservedbandwidth.
 12. The medium of claim 8, wherein configuring furtherincludes instructing parent nodes to the intermediate nodes to set asideexcess bandwidth from the adjacent nodes for use by the intermediatenodes when necessary and when the network transaction is processed. 13.A system, comprising: a means for identifying current bandwidth beingdirected to a destination node associated with a pending networktransaction; and a means for guaranteeing reserved bandwidth to processthe pending network transaction based on a path for the pending networktransaction from an originating node to the destination node, whereinintermediate nodes along the path borrow bandwidth from adjacent nodesto assure each of the intermediate nodes is capable of handling thatintermediate node's level of bandwidth for guaranteeing the reservedbandwidth.
 14. The system of claim 13, wherein the means for identifyingfurther includes a means for summing existing bandwidth from particularnodes connecting to the destination node to identify the currentbandwidth.
 15. The system of claim 13, wherein the means forguaranteeing further includes a means for configuring parent nodes tothe intermediate nodes to have the parent nodes set aside a level ofbandwidth for the adjacent nodes to ensure the level of bandwidth isavailable to the intermediate nodes when the network transaction isprocessed.
 16. The system of claim 13, wherein the system includes afirst node associated with the path and the first node receiving thenetwork transaction from the originating node.
 17. The system of claim16, wherein the first node notifies the originating node that thenetwork transaction is guaranteed to process the network transactionwith the reserved bandwidth.
 18. An apparatus, comprising: a firstnetwork link to a previous node of a network; and a plurality ofadditional links to next nodes of the network; wherein the apparatussets aside a level of bandwidth from one or more of the next nodes forconsumption by a particular one of the next nodes to process a portionof a network transaction through the network.
 19. The apparatus of claim18, wherein the apparatus is a father node to the next nodes.
 20. Theapparatus of claim 19, wherein the particular one of the next nodes isan intermediate node along a network path for the network transaction.21. The apparatus of claim 20, wherein remaining ones of the next nodesare sibling nodes to the particular one of the next nodes.